partial node
英 [ˈpɑːʃl nəʊd]
美 [ˈpɑːrʃl noʊd]
网络 次节
双语例句
- Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.
由于对消息树进行部分解析时并不会完全解析，因此消息将路由到下一个节点。 - A predicate is a partial expression that can be applied to an existing node set.
谓词是用于已有节点集的部分表达式。 - Partial recurrence, lymph node metastasis and the expression of GST-π and TOpo ⅱ can be regarded as independent prognostic factors in cervical carcinoma.
局部复发、淋巴结转移及TOpoⅡ、GST-π的表达可作为宫颈癌患者独立的预后因素。 - The other received partial maxillectomy and radiotherapy, but local lymph node metastasis was found 1 year later and local recurrence was diagnosed 3 years later.
1例行上颌骨次全切除术加放疗，术后1年发现颈部淋巴结转移，3年局部复发。 - The Model Test& Research Work for Partial Flexibility of Plastic Pipe Node
海洋平台塑料管节点模型局部柔度试验研究 - At first, the attribute of knowledge node basic partial model in the whole model exactly expresses the basic character of content of knowledge node, therefore enable these knowledge node easily to be controlled for teaching.
该模型的合理性和优越性表现在以下几个方面：首先，课件模型中的知识点基本模型的各项属性反映了知识点的基本特征，便于教学控制； - In addition, an algorithm of automatically building transfer rule of each task node according to the partial ordering of change node was put forward.
此外，还提出了一个根据工作流模型修改点的偏序关系自动生成各节点迁移规则的算法。 - Performing the partial voltage control regions on the basis of genetic algorithm, the obtained partial voltage control regions not only incarnate the practical situation of power system, but also possess optimal node sequence for voltage regulation.
基于遗传算法进行局部电压控制分域，得到了既符合电网实际又具有最佳节点调整序列的局部无功电压控制域。 - Partial Eight Node Finite Element with Equivalent Crosswise Displacement
偏八结点等横向位移有限元 - Theoretical research and simulation analysis indicate that the average partial interference coefficient has no relationship with node density in the network, and it can be approximated as a linear function of link distance.
理论研究与仿真分析表明，平均部分干扰系数与网络节点密度无关，可以近似表示为链路长度的线性函数。 - The IPCB algorithm combines the method of hypothesis testing and partial correlation coefficients to select candidate neighbors of the target node. A greedy hill-climbing search is performed in a constrained space to obtain the ultimate causal structure.
IPCB算法结合假设检验方法和偏相关系数，选择目标节点的候选邻居节点，继而在受限的空间里进行受限的贪婪搜索，最终得到相应的因果结构。